- sorting time
- <edp> ■ Sortierzeit f
English-german technical dictionary. 2013.
sorting time
Schlagen Sie auch in anderen Wörterbüchern nach:
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Sorting — For the sorting of sediment, see Sorting (sediment). Sorting type Sorting is any process of arranging items in some sequence and/or in different sets, and accordingly, it has two common, yet distinct meanings: ordering: arranging items of the… … Wikipedia
Sorting network — A sorting network is an abstract mathematical model of a network of wires and comparator modules that is used to sort a sequence of numbers. Each comparator connects two wires and sort the values by outputting the smaller value to one wire, and a … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Time Enough at Last — Infobox Television episode Title = Time Enough at Last Series = The Twilight Zone Caption = Burgess Meredith as Henry Bemis Season = 1 Episode = 8 Airdate = November 20, 1959 Production = 173 3614 Writer = Rod Serling (Original story: Lyn… … Wikipedia
Sorting — Sort Sort, v. t. [imp. & p. p. {Sorted}; p. pr. & vb. n. {Sorting}.] 1. To separate, and place in distinct classes or divisions, as things having different qualities; as, to sort cloths according to their colors; to sort wool or thread according… … The Collaborative International Dictionary of English
Time Delay and Integration — A Time Delay and Integration (TDI) charge coupled device (CCD) is widely used for observation of high speed moving objects undetectable by classic CCD. Useful in a wide range of imaging applications that require both high speed and high… … Wikipedia
Time delay and integration — A time delay and integration (TDI) charge coupled device (CCD) is widely used for observation of high speed moving objects undetectable by classic CCD. Useful in a wide range of imaging applications that require both high speed and high… … Wikipedia
Topological sorting — Dependency resolution redirects here. For other uses, see Dependency (disambiguation). In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that, for every edge uv, u comes… … Wikipedia
Patience sorting — is a sorting algorithm, based on a solitaire card game, that has the property of being able to efficiently compute the length of the longest increasing subsequence in a given array.The card gameThe game begins with a shuffled deck of cards,… … Wikipedia
Pancake sorting — is a variation of the sorting problem in which the only allowed operation is to reverse the elements of some prefix of the sequence. Unlike a traditional sorting algorithm, which attempts to sort with the least comparisons possible, the goal is… … Wikipedia
